Optimal Morphologies of n-Omino-Based Reconfigurable Robot for Area Coverage Task Using Metaheuristic Optimization

نویسندگان

چکیده

Reconfigurable robots design based on polyominos or n-Omino is increasingly being explored in cleaning and maintenance (CnM) tasks due to their ability change shape using intra- inter-reconfiguration, resulting various footprints of the robot. On one hand, reconfiguration during a CnM task given environment map results enhanced area coverage over fixed-form robots. However, it also consumes more energy additional effort required continuously while covering map, leading deterioration overall performance. This paper proposes new strategy for n-Omino-based select range optimal morphologies that maximizes minimizes consumption. The “morphology” two factors: footprint obtained by varying angles between blocks number blocks, i.e., “n”. proposed approach combines Footprint-Based Complete Path planner (FBCP) with metaheuristic optimization algorithm identify an reconfigurable robot’s configuration, assuming consumption proportional path length taken demonstrated robot named Smorphi, which has square-shaped omino holonomic locomotion from monomino tetromino. Three different simulated environments are used find Smorphi three techniques, namely, MOEA/D, OMOPSO, HypE. study show morphology produced this efficient, minimizing maximizing coverage. Furthermore, HypE identified as efficient generating took less time converge than other algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robot Formations for Area Coverage

Two algorithms for area coverage (for use in space applications) were evaluated using a simulator and then tested on a multi-robot society consisting of LEGO Mindstorms robots. The two algorithms are (i) a vector force based implementation and (ii) a machine learning approach. The second is based on an organizational-learning oriented classifier system (OCS) introduced by Takadama in 1998.

متن کامل

Tackling Area Coverage Problems in a Reconfigurable Floor Cleaning Robot Based on Polyomino Tiling Theory

Whilst Polyomino tiling theory has been extensively studied as a branch of research in mathematics, its application has been largely confined to multimedia, graphics and gaming domains. In this paper, we present a novel application of Tromino tiling theory, a class of Polyomino with three cells in the context of a reconfigurable floor cleaning robot, hTromo. The developed robot platform is able...

متن کامل

optimization, controller and observer design of a reconfigurable mobile robot using genetic algorithm and neural network

in this research optimal reconfiguration strategy of the improved srr reconfigurable mobile robot based on force-angle stability measure has been designed using genetic algorithm. path tracking nonlinear controller which keeps robot’s maximum stability has been designed and simulated in matlab. motion equations of the robot have been derived in parametric form by means of newton- euler, lagrang...

متن کامل

Cycle Time Optimization of Processes Using an Entropy-Based Learning for Task Allocation

Cycle time optimization could be one of the great challenges in business process management. Although there is much research on this subject, task similarities have been paid little attention. In this paper, a new approach is proposed to optimize cycle time by minimizing entropy of work lists in resource allocation while keeping workloads balanced. The idea of the entropy of work lists comes fr...

متن کامل

On multi-robot area coverage

Area coverage is one of the emerging problems in multi-robot coordination. In this task a team of robots is cooperatively trying to observe or sweep an entire area, possibly containing obstacles, with their sensors or actuators. The goal is to build an efficient path for each robot which jointly ensure that every single point in the environment can be seen or swept by at least one of the robots...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11040948